The Coincidence Test: a Bayesian Statistical Test for Block Ciphers and MACs

نویسنده

  • Alan Kaminsky
چکیده

A block cipher or message authentication code (MAC) should behave as a random mapping. The mapping’s randomness can be evaluated with statistical tests. Statistical test suites typically used for this purpose, such as the NIST test suite, are not well-suited for block ciphers and MACs; also, these test suites employ a frequentist approach, making it difficult to obtain an overall evaluation of the mapping’s randomness. This paper describes a statistical test, the coincidence test, that overcomes the aforementioned deficiencies. The coincidence test is well-suited for block ciphers and MACs, and it employs a Bayesian approach that quite naturally yields an overall evaluation of the mapping’s randomness. Results of applying the coincidence test to reduced-round and full-round versions of the PRESENT and IDEA block ciphers and the SipHash and SQUASH MACs are reported; the results are analyzed to determine the algorithms’ randomness margins.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Analysis of KASUMI Block Cipher

A block cipher or a message authentication code(MAC ) should behave as random mapping which can be evaluated during statistical tests. Statistical test suites typically used for evaluation of random mapping are NIST, Diehard, Dieharder and TestU01 which are not well-suited for block ciphers and MAC s. These test suites employ frequentist approach;thus, making it difficult to overall evaluate th...

متن کامل

Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited

Almost all current block-cipher-based MACs reduce their security to the pseudorandomness of their underlying block ciphers, except for a few of them to the unpredictability, a strictly weaker security notion than pseudorandomness. However, the latter MACs offer relatively low efficiency. In this paper, we investigate the feasibility of constructing rate-1 MACs from related-key unpredictable blo...

متن کامل

New Attacks against Standardized MACs

In this paper, we revisit the security of several message authentication code (MAC) algorithms based on block ciphers, when instantiated with 64-bit block ciphers such as DES. We essentially focus on algorithms that were proposed in the norm ISO/IEC 9797–1. We consider both forgery attacks and key recovery attacks. Our results improve upon the previously known attacks and show that all algorith...

متن کامل

The SAC Test: A New Randomness Test, with Some Applications to PRNG Analysis

A new statistical test for randomness, the SAC test, is presented, together with its results over some well-known generators in the literature. These results are analyzed and some possible applications of the test, as for measuring the strength of cryptographic primitives including block ciphers, stream ciphers and pseudorandom number generators, especially during the design and analysis phase,...

متن کامل

Comparison of Blowfish and Cast-128 Algorithms Using Encryption Quality, Key Sensitivity and Correlation Coefficient Analysis

This paper demonstrates the performance of well known block ciphers Blowfish and Cast-128, considering different aspects of security namely, Encryption quality, Key sensitivity test and Statistical analysis. Statistical analysis is conducted using images by test on the histogram of encrypted images and correlation of horizontally adjacent pixels in an encrypted image.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013